________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:43:23
Input Data from:  dataset161.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0603333333333333
Average f[i]   :4650
Average g[i,j] :1983,33333333333
Total demand   :16830
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 55
> Selected Move:	2420	1	-1	2	4000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2420


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 55
> Selected Move:	3450	1	-1	5	10000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3450


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 63
> Selected Move:	4720	1	-1	17	16000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 4720


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 32
> Selected Move:	5790	1	-1	7	21000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 5790


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 42
> Selected Move:	6640	1	-1	12	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  0  0  0  0  1  0  0    >new incumb.: 6640


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 44
> Selected Move:	6570	3	2	15	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 43
> Selected Move:	6550	3	12	2	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 52
> Selected Move:	6410	3	17	12	23000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 75
> Selected Move:	6380	3	15	3	25000


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 55
> Selected Move:	6380	3	3	9	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 64
> Selected Move:	6360	3	5	17	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 39
> Selected Move:	6330	3	9	15	23000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 39
> Selected Move:	6330	3	7	5	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 54
> Selected Move:	6330	3	15	14	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 36
> Selected Move:	6340	3	2	7	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 37
> Selected Move:	6340	3	17	15	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 70
> Selected Move:	6320	3	12	2	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 68
> Selected Move:	6340	3	14	8	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 71
> Selected Move:	6280	3	8	13	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 60
> Selected Move:	6300	3	2	12	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 73
> Selected Move:	6315	3	15	17	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 41
> Selected Move:	6298	3	12	2	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 45
> Selected Move:	6340	3	13	14	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 46
> Selected Move:	6273	3	2	15	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 24 #######################


> Neighbours evaluated; 39
> Selected Move:	6240	3	5	2	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 25 #######################


> Neighbours evaluated; 38
> Selected Move:	6260	3	14	8	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 26 #######################


> Neighbours evaluated; 45
> Selected Move:	6260	3	7	5	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 27 #######################


> Neighbours evaluated; 41
> Selected Move:	6240	3	8	14	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 28 #######################


> Neighbours evaluated; 44
> Selected Move:	6200	3	14	13	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 29 #######################


> Neighbours evaluated; 40
> Selected Move:	6290	3	15	12	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 30 #######################


> Neighbours evaluated; 51
> Selected Move:	6190	3	13	8	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,385

## ITERATION 31 #######################


> Neighbours evaluated; 38
> Selected Move:	6238	3	2	7	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 32 #######################


> Neighbours evaluated; 44
> Selected Move:	6220	3	12	2	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 33 #######################


> Neighbours evaluated; 48
> Selected Move:	6153	3	2	15	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 34 #######################


> Neighbours evaluated; 53
> Selected Move:	6255	3	8	13	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 35 #######################


> Neighbours evaluated; 43
> Selected Move:	6200	3	5	2	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 36 #######################


> Neighbours evaluated; 43
> Selected Move:	6180	3	13	18	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 37 #######################


> Neighbours evaluated; 46
> Selected Move:	6210	3	17	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 38 #######################


> Neighbours evaluated; 64
> Selected Move:	6230	3	2	12	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 39 #######################


> Neighbours evaluated; 67
> Selected Move:	6220	3	18	8	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 40 #######################


> Neighbours evaluated; 70
> Selected Move:	6340	1	-1	2	27500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 41 #######################


> Neighbours evaluated; 28
> Selected Move:	6535	3	5	14	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 42 #######################


> Neighbours evaluated; 43
> Selected Move:	6490	3	14	13	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 43 #######################


> Neighbours evaluated; 50
> Selected Move:	6243	3	8	5	27500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 44 #######################


> Neighbours evaluated; 36
> Selected Move:	6270	3	13	14	27500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 45 #######################


> Neighbours evaluated; 36
> Selected Move:	6178	3	5	17	27500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 46 #######################


> Neighbours evaluated; 26
> Selected Move:	6185	3	14	8	27500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 47 #######################


> Neighbours evaluated; 30
> Selected Move:	6150	2	15	-1	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 48 #######################


> Neighbours evaluated; 45
> Selected Move:	6190	3	8	18	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,385

## ITERATION 49 #######################


> Neighbours evaluated; 42
> Selected Move:	6190	3	17	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 50 #######################


> Neighbours evaluated; 60
> Selected Move:	6180	3	5	3	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 51 #######################


> Neighbours evaluated; 40
> Selected Move:	6090	3	3	9	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 52 #######################


> Neighbours evaluated; 55
> Selected Move:	6090	3	18	8	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 53 #######################


> Neighbours evaluated; 56
> Selected Move:	6150	3	9	5	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 54 #######################


> Neighbours evaluated; 72
> Selected Move:	6130	3	8	14	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 55 #######################


> Neighbours evaluated; 76
> Selected Move:	6130	3	5	17	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 56 #######################


> Neighbours evaluated; 34
> Selected Move:	6146	3	1	5	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 57 #######################


> Neighbours evaluated; 37
> Selected Move:	6260	3	14	15	24800


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 58 #######################


> Neighbours evaluated; 43
> Selected Move:	6260	4	5	17	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  1  0  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 59 #######################


> Neighbours evaluated; 54
> Selected Move:	6110	3	17	16	24500


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 60 #######################


> Neighbours evaluated; 58
> Selected Move:	6078	3	16	18	25200


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 61 #######################


> Neighbours evaluated; 43
> Selected Move:	6150	4	18	5	24800


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 62 #######################


> Neighbours evaluated; 61
> Selected Move:	6040	3	5	1	23000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 63 #######################


> Neighbours evaluated; 59
> Selected Move:	6140	3	18	11	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 64 #######################


> Neighbours evaluated; 37
> Selected Move:	6210	3	2	5	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 65 #######################


> Neighbours evaluated; 57
> Selected Move:	6193	3	12	2	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 66 #######################


> Neighbours evaluated; 63
> Selected Move:	6140	3	7	12	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 67 #######################


> Neighbours evaluated; 59
> Selected Move:	6150	3	11	19	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 68 #######################


> Neighbours evaluated; 75
> Selected Move:	6180	3	15	17	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,315

## ITERATION 69 #######################


> Neighbours evaluated; 68
> Selected Move:	6150	3	5	15	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,31

## ITERATION 70 #######################


> Neighbours evaluated; 49
> Selected Move:	6135	3	12	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 71 #######################


> Neighbours evaluated; 61
> Selected Move:	6080	3	5	8	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 72 #######################


> Neighbours evaluated; 45
> Selected Move:	6100	3	19	12	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 73 #######################


> Neighbours evaluated; 40
> Selected Move:	6270	1	-1	14	27000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 74 #######################


> Neighbours evaluated; 33
> Selected Move:	6280	3	17	5	27000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 75 #######################


> Neighbours evaluated; 46
> Selected Move:	6230	3	14	13	27000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 76 #######################


> Neighbours evaluated; 46
> Selected Move:	6200	3	5	17	27000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 77 #######################


> Neighbours evaluated; 29
> Selected Move:	6263	3	8	7	27500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 78 #######################


> Neighbours evaluated; 34
> Selected Move:	6120	3	13	5	29000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 79 #######################


> Neighbours evaluated; 15
> Selected Move:	6195	4	0	5	25200


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 80 #######################


> Neighbours evaluated; 47
> Selected Move:	6161	4	5	17	25300


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  0  0  0  0  1  0  0  1  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 81 #######################


> Neighbours evaluated; 54
> Selected Move:	6070	3	17	11	24900


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  0  0  0  2  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 82 #######################


> Neighbours evaluated; 60
> Selected Move:	6004	3	11	18	25400


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 83 #######################


> Neighbours evaluated; 41
> Selected Move:	6071	4	18	5	25200


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 84 #######################


> Neighbours evaluated; 57
> Selected Move:	6030	3	18	14	23700


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 85 #######################


> Neighbours evaluated; 59
> Selected Move:	6100	3	5	0	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 86 #######################


> Neighbours evaluated; 58
> Selected Move:	6120	3	14	8	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 87 #######################


> Neighbours evaluated; 62
> Selected Move:	6120	3	7	5	22500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 88 #######################


> Neighbours evaluated; 66
> Selected Move:	6100	3	2	17	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 89 #######################


> Neighbours evaluated; 38
> Selected Move:	6100	3	5	7	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 90 #######################


> Neighbours evaluated; 50
> Selected Move:	6080	3	8	14	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 91 #######################


> Neighbours evaluated; 43
> Selected Move:	6084	3	1	5	25300


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  0  0  0  0  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 92 #######################


> Neighbours evaluated; 39
> Selected Move:	6065	3	12	2	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 93 #######################


> Neighbours evaluated; 42
> Selected Move:	6030	3	17	12	23300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 94 #######################


> Neighbours evaluated; 69
> Selected Move:	6030	4	5	7	24300


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 95 #######################


> Neighbours evaluated; 61
> Selected Move:	6100	3	7	1	22500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 96 #######################


> Neighbours evaluated; 66
> Selected Move:	6080	3	2	17	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 97 #######################


> Neighbours evaluated; 38
> Selected Move:	6080	3	5	2	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 98 #######################


> Neighbours evaluated; 40
> Selected Move:	6060	3	12	19	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,315

## ITERATION 99 #######################


> Neighbours evaluated; 41
> Selected Move:	6060	3	17	5	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 100 #######################


> Neighbours evaluated; 66
> Selected Move:	6080	3	14	8	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 101 #######################


> Neighbours evaluated; 65
> Selected Move:	6070	3	19	11	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 102 #######################


> Neighbours evaluated; 49
> Selected Move:	6070	3	5	7	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 103 #######################


> Neighbours evaluated; 64
> Selected Move:	6050	3	8	14	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 104 #######################


> Neighbours evaluated; 47
> Selected Move:	6050	3	7	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 105 #######################


> Neighbours evaluated; 50
> Selected Move:	6030	3	11	8	23000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 106 #######################


> Neighbours evaluated; 47
> Selected Move:	6260	1	-1	7	28000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 107 #######################


> Neighbours evaluated; 43
> Selected Move:	6235	3	14	13	28000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 108 #######################


> Neighbours evaluated; 51
> Selected Move:	6170	3	5	17	28000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 109 #######################


> Neighbours evaluated; 38
> Selected Move:	6225	3	13	14	28000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  0  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 110 #######################


> Neighbours evaluated; 38
> Selected Move:	6160	3	14	5	29500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 111 #######################


> Neighbours evaluated; 23
> Selected Move:	6183	3	7	12	28500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 112 #######################


> Neighbours evaluated; 28
> Selected Move:	6145	3	8	14	28500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 113 #######################


> Neighbours evaluated; 31
> Selected Move:	6163	3	15	7	29500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 114 #######################


> Neighbours evaluated; 22
> Selected Move:	6120	4	1	17	25500


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  1  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 115 #######################


> Neighbours evaluated; 43
> Selected Move:	6078	3	14	13	25500


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  1  1  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 116 #######################


> Neighbours evaluated; 37
> Selected Move:	6133	4	17	5	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 117 #######################


> Neighbours evaluated; 45
> Selected Move:	6094	3	13	6	25800


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 118 #######################


> Neighbours evaluated; 31
> Selected Move:	6060	3	6	4	24800


> New Y[]: 
	
	 2  0  1  0  1  3  0  1  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 119 #######################


> Neighbours evaluated; 27
> Selected Move:	6060	4	5	17	25000


> New Y[]: 
	
	 2  0  1  0  1  1  0  1  0  0  0  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 120 #######################


> Neighbours evaluated; 30
> Selected Move:	6020	3	4	6	26000


> New Y[]: 
	
	 2  0  1  0  0  1  1  1  0  0  0  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 121 #######################


> Neighbours evaluated; 37
> Selected Move:	5980	3	5	8	24500


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  1  0  0  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 122 #######################


> Neighbours evaluated; 26
> Selected Move:	5960	3	8	14	24500


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  0  0  0  0  1  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 123 #######################


> Neighbours evaluated; 26
> Selected Move:	5960	3	17	5	24300


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  0  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 124 #######################


> Neighbours evaluated; 66
> Selected Move:	5960	3	14	8	24300


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 125 #######################


> Neighbours evaluated; 49
> Selected Move:	6013	3	6	17	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 126 #######################


> Neighbours evaluated; 40
> Selected Move:	5974	3	8	18	26800


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 127 #######################


> Neighbours evaluated; 49
> Selected Move:	5946	3	17	14	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 128 #######################


> Neighbours evaluated; 52
> Selected Move:	5987	3	2	15	25300


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  0  0  0  0  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 129 #######################


> Neighbours evaluated; 47
> Selected Move:	5966	3	12	2	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 130 #######################


> Neighbours evaluated; 46
> Selected Move:	5950	3	5	1	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 131 #######################


> Neighbours evaluated; 55
> Selected Move:	6030	3	18	8	22000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 132 #######################


> Neighbours evaluated; 53
> Selected Move:	6110	3	2	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 133 #######################


> Neighbours evaluated; 70
> Selected Move:	6070	3	14	13	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 134 #######################


> Neighbours evaluated; 70
> Selected Move:	6020	3	15	2	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 135 #######################


> Neighbours evaluated; 75
> Selected Move:	6138	3	13	3	25500


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 136 #######################


> Neighbours evaluated; 68
> Selected Move:	6135	3	3	9	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 137 #######################


> Neighbours evaluated; 68
> Selected Move:	6113	3	5	17	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 138 #######################


> Neighbours evaluated; 40
> Selected Move:	6090	3	7	12	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,355

## ITERATION 139 #######################


> Neighbours evaluated; 37
> Selected Move:	6090	3	17	5	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 140 #######################


> Neighbours evaluated; 64
> Selected Move:	6090	3	9	3	24500


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 141 #######################


> Neighbours evaluated; 55
> Selected Move:	6090	3	5	7	23500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 142 #######################


> Neighbours evaluated; 70
> Selected Move:	6030	3	8	13	23500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 143 #######################


> Neighbours evaluated; 55
> Selected Move:	6103	3	2	5	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 144 #######################


> Neighbours evaluated; 65
> Selected Move:	6120	3	13	15	25000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 145 #######################


> Neighbours evaluated; 66
> Selected Move:	6100	3	12	2	25000


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 146 #######################


> Neighbours evaluated; 82
> Selected Move:	6090	3	15	13	25500


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 147 #######################


> Neighbours evaluated; 72
> Selected Move:	6093	3	3	9	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 148 #######################


> Neighbours evaluated; 72
> Selected Move:	6115	3	2	12	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 149 #######################


> Neighbours evaluated; 68
> Selected Move:	6128	3	13	14	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  1  0  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 150 #######################


> Neighbours evaluated; 67
> Selected Move:	6105	3	12	2	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 151 #######################


> Neighbours evaluated; 79
> Selected Move:	6083	3	5	17	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 152 #######################


> Neighbours evaluated; 41
> Selected Move:	6070	3	14	13	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 153 #######################


> Neighbours evaluated; 40
> Selected Move:	6090	3	9	12	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,33

## ITERATION 154 #######################


> Neighbours evaluated; 40
> Selected Move:	6090	3	17	5	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 155 #######################


> Neighbours evaluated; 74
> Selected Move:	6060	3	5	15	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 156 #######################


> Neighbours evaluated; 58
> Selected Move:	6060	3	7	5	22500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 157 #######################


> Neighbours evaluated; 68
> Selected Move:	6040	3	2	17	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 158 #######################


> Neighbours evaluated; 36
> Selected Move:	6045	3	13	19	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 159 #######################


> Neighbours evaluated; 54
> Selected Move:	6010	3	5	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,35

## ITERATION 160 #######################


> Neighbours evaluated; 41
> Selected Move:	6010	3	17	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 161 #######################


> Neighbours evaluated; 56
> Selected Move:	5990	3	8	14	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 162 #######################


> Neighbours evaluated; 55
> Selected Move:	5990	3	5	17	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,335

## ITERATION 163 #######################


> Neighbours evaluated; 36
> Selected Move:	5980	3	14	7	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,33

## ITERATION 164 #######################


> Neighbours evaluated; 66
> Selected Move:	6040	3	19	13	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  0  0  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 165 #######################


> Neighbours evaluated; 43
> Selected Move:	6053	3	1	5	25300


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  0  0  0  0  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 166 #######################


> Neighbours evaluated; 42
> Selected Move:	6034	3	12	2	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  0  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 167 #######################


> Neighbours evaluated; 43
> Selected Move:	5990	3	17	12	23300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 168 #######################


> Neighbours evaluated; 71
> Selected Move:	6017	3	13	16	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 169 #######################


> Neighbours evaluated; 65
> Selected Move:	5979	3	16	11	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 170 #######################


> Neighbours evaluated; 36
> Selected Move:	6070	4	5	11	24500


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  3  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 171 #######################


> Neighbours evaluated; 70
> Selected Move:	6000	3	2	14	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  3  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 172 #######################


> Neighbours evaluated; 56
> Selected Move:	6045	3	11	17	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  0  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 173 #######################


> Neighbours evaluated; 40
> Selected Move:	6040	3	17	16	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  0  1  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 174 #######################


> Neighbours evaluated; 48
> Selected Move:	6020	3	12	2	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  0  0  1  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 175 #######################


> Neighbours evaluated; 55
> Selected Move:	6040	3	14	8	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  0  0  0  0  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 176 #######################


> Neighbours evaluated; 42
> Selected Move:	5980	3	8	13	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  0  1  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 177 #######################


> Neighbours evaluated; 47
> Selected Move:	6000	3	2	12	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  1  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 178 #######################


> Neighbours evaluated; 59
> Selected Move:	6005	3	16	17	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  1  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 179 #######################


> Neighbours evaluated; 41
> Selected Move:	5988	3	12	2	25500


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  0  1  0  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 180 #######################


> Neighbours evaluated; 48
> Selected Move:	6030	3	13	14	25500


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  0  0  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 181 #######################


> Neighbours evaluated; 49
> Selected Move:	5980	3	17	11	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  3  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 182 #######################


> Neighbours evaluated; 62
> Selected Move:	5940	3	14	13	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  3  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 183 #######################


> Neighbours evaluated; 58
> Selected Move:	5960	3	2	12	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  3  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 184 #######################


> Neighbours evaluated; 68
> Selected Move:	5858	3	11	18	25700


> New Y[]: 
	
	 2  0  0  0  0  1  0  1  0  0  0  0  1  1  0  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 185 #######################


> Neighbours evaluated; 42
> Selected Move:	5964	4	18	5	25300


> New Y[]: 
	
	 2  0  0  0  0  3  0  1  0  0  0  0  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 186 #######################


> Neighbours evaluated; 59
> Selected Move:	5942	3	12	2	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 187 #######################


> Neighbours evaluated; 58
> Selected Move:	5921	3	15	12	25300


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  0  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 188 #######################


> Neighbours evaluated; 57
> Selected Move:	5920	3	18	6	24300


> New Y[]: 
	
	 2  0  1  0  0  3  1  1  0  0  0  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 189 #######################


> Neighbours evaluated; 67
> Selected Move:	5920	3	5	17	24500


> New Y[]: 
	
	 2  0  1  0  0  0  1  1  0  0  0  0  1  1  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 190 #######################


> Neighbours evaluated; 30
> Selected Move:	5850	3	6	18	25500


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  0  0  0  0  1  1  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 191 #######################


> Neighbours evaluated; 43
> Selected Move:	5980	3	13	5	27000


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  0  0  0  0  1  0  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 192 #######################


> Neighbours evaluated; 50
> Selected Move:	5965	3	18	8	25500


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  0  0  0  1  0  0  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 193 #######################


> Neighbours evaluated; 43
> Selected Move:	5903	3	5	18	25500


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 194 #######################


> Neighbours evaluated; 48
> Selected Move:	5950	3	17	1	23500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 195 #######################


> Neighbours evaluated; 61
> Selected Move:	6058	1	-1	15	27500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 196 #######################


> Neighbours evaluated; 48
> Selected Move:	6045	3	18	4	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 197 #######################


> Neighbours evaluated; 30
> Selected Move:	6023	3	8	14	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 198 #######################


> Neighbours evaluated; 32
> Selected Move:	6060	3	4	13	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 199 #######################


> Neighbours evaluated; 53
> Selected Move:	5988	3	13	18	27500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 200 #######################


> Neighbours evaluated; 40
> Selected Move:	5935	3	14	13	27500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 201 #######################


> Neighbours evaluated; 44
> Selected Move:	5973	3	18	4	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 202 #######################


> Neighbours evaluated; 34
> Selected Move:	5890	3	7	8	25000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 203 #######################


> Neighbours evaluated; 22
> Selected Move:	6093	3	4	19	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 204 #######################


> Neighbours evaluated; 42
> Selected Move:	6125	3	13	14	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,355
________________________________________________________________

Best solution found: 6640
Run Termination time: 03.02.2010 21:45:18
Run duration: 00:01:55.2656250
________________________________________________________________
